A Construction that Preserves the Number of k-Kernels
نویسنده
چکیده
Let D be a digraph. Let k be a natural number with k 2. A set J ⊆ V (D) will be called a k-kernel of the digraph D iff: 1) For each x, x′ ∈ J , x = x′ we have dD(x, x′) k and 2) For each y ∈ V (D) − J , there exists x ∈ J such that dD(y, x) ≤ k − 1. In [4], for any digraph D we constructed a digraph s(S) such that D has a k-kernel iff s(S) has a k-kernel. In this paper we prove that the number of k-kernels in s(S) is equal to the number of k-kernels in D. Mathematics Subject Classification: 05C20
منابع مشابه
یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیکهای یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملDesign, Construction and Performance Evaluation of the Walnut Cracking Machine
The traditional method in Iran of cracking walnut manually, using harmer or knife cutter is laborintensive, slow and tedious; besides, most mechanical crackers do not give satisfactory results in terms of kernel extraction quality. A prototype machine was developed to crack walnut. A walnut cracker was designed, constructed and tested to evaluate its performance. The cracker, which consists of ...
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملThe Effect of Thermal Pretreatment and Packaging Conditions on the Shelf-life of Walnut Kernels
This study aimed to extend the shelf life of walnut kernels by appropriate packaging conditions and physical methods. For this purpose, the kernels were heated at 50 or 70°C for 2 or 10 minutes. About 100g of walnuts were packed in low-density polyethylene (LDPE) packages under ordinary, vacuum or nitrogen conditions. Samples were stored for 18 months at room temperature. Peroxide value and aci...
متن کامل